Self-stabilizing philosophers with generic conflicts
نویسندگان
چکیده
منابع مشابه
Comparing Self-Stabilizing Dining Philosophers through Simulation
We evaluate the performance of five of the most well-known selfstabilizing dining philosophers algorithms in a read/write atomicity model. The algorithms are evaluated under interleaving, power-set and synchronous execution semantics. For all algorithms, we compute latency and throughput of critical section access, as well as the number of safety violations. These metrics are computed under var...
متن کاملBin Packing with Conflicts: A Generic Branch-and-Price Algorithm
The bin packing problem with conflicts consists in packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates the comparatively good performance of a generic Branch-and-Price algorithm for this problem. We made use of our black-box solver BaPCod, relying on its generic branching scheme and primal heuristic...
متن کاملSelf-stabilizing Deterministic Gathering
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...
متن کاملSelf-Stabilizing Paxos
We present the first self-stabilizing consensus and replicated state machine for asynchronousmessage passing systems. The scheme does not require that all participants make a certain numberof steps prior to reaching a practically infinite execution where the replicated state machine exhibitsthe desired behavior. In other words, the system reaches a configuration from which it operat...
متن کاملSelf-stabilizing Virtual Synchrony
Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Autonomous and Adaptive Systems
سال: 2009
ISSN: 1556-4665,1556-4703
DOI: 10.1145/1462187.1462194